package com.course.designpatterns.strategy;

/**
 * @author ：Jack Hao
 * @date ：Created in 2021/6/20 21:50
 * @description：
 */
public class Sorter2<T>
{

    public  void sort(T[] arr,MyComparator<T> comparator){
        for (int i = 0; i <arr.length ; i++)
        {
            int minPos = i;
            for (int j = 0; j <arr.length ; j++)
            {
                minPos = comparator.compare(arr[j],arr[minPos]) == -1 ? j : minPos;
            }
            swap(arr,i,minPos);
        }
    }

     void swap(T[] arr, int i,int j){
        T temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}
